Generating random elements of a finite group
نویسندگان
چکیده
منابع مشابه
Generating Random Elements of a Finite Group
We present a “practical” algorithm to construct random elements of a finite group. We analyse its theoretical behaviour and prove that asymptotically it produces uniformly distributed tuples of elements. We discuss tests to assess its effectiveness and use these to decide when its results are acceptable for some matrix groups.
متن کاملGenerating random elements of finite distributive lattices
This survey article describes a method for choosing uniformly at random from any finite set whose objects can be viewed as constituting a distributive lattice. The method is based on ideas of the author and David Wilson for using “coupling from the past” to remove initialization bias from Monte Carlo randomization. The article describes several applications to specific kinds of combinatorial ob...
متن کاملGenerating Random Elements in Finite Groups
Let G be a finite group of order g. A probability distribution Z on G is called ε-uniform if |Z(x) − 1/g| ≤ ε/g for each x ∈ G. If x1, x2, . . . , xm is a list of elements of G, then the random cube Zm := Cube(x1, . . . , xm) is the probability distribution where Zm(y) is proportional to the number of ways in which y can be written as a product x1 1 x ε2 2 · · · xεm m with each εi = 0 or 1. Let...
متن کاملWhich elements of a finite group are non-vanishing?
Let $G$ be a finite group. An element $gin G$ is called non-vanishing, if for every irreducible complex character $chi$ of $G$, $chi(g)neq 0$. The bi-Cayley graph ${rm BCay}(G,T)$ of $G$ with respect to a subset $Tsubseteq G$, is an undirected graph with vertex set $Gtimes{1,2}$ and edge set ${{(x,1),(tx,2)}mid xin G, tin T}$. Let ${rm nv}(G)$ be the set of all non-vanishi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Algebra
سال: 1995
ISSN: 0092-7872,1532-4125
DOI: 10.1080/00927879508825509